Shelling Hexahedral Complexes for Mesh Generation
نویسنده
چکیده
We present a new approach for the generation of hexahedral finite element meshes for solid bodies in computer-aided design. The key idea is to use a purely combinatorial method, namely a shelling process, to decompose a topological ball with a prescribed surface mesh into combinatorial cubes, so-called hexahedra. The shelling corresponds to a series of graph transformations on the surface mesh which is guided by the cycle structure of the combinatorial dual. Our method transforms the graph of the surface mesh iteratively by changing the dual cycle structure until we get the surface mesh of a single hexahedron. Starting with a single hexahedron and reversing the order of the graph transformations, each transformation step can be interpreted as adding one or more hexahedra to the so far created hex complex. Given an arbitrary solid body, we first decompose it into simpler subdomains equivalent to topological balls by adding virtual 2-manifolds. Second, we determine a compatible quadrilateral surface mesh for all created subdomains. Then, in the main part we can use the shelling of topological balls to build up a hex complex for each subdomain independently. Finally, the combinatorial mesh(es) are embedded into the given solids and smoothed to improve quality. Communicated by T. Nishizeki, R. Tamassia and D. Wagner: submitted January 1999; revised August 2000 and July 2001. The author was partially supported by the special program “Efficient Algorithms for Discrete Problems and Their Applications” of the Deutsche Forschungsgemeinschaft (DFG) under grant Mo 446/2-3. M. Müller-Hannemann, Shelling Hexahedral Complexes, JGAA, 5(5) 59–91 (2001)60
منابع مشابه
Methods and Applications of Generalized Sheet Insertion for Hexahedral Meshing
This paper presents methods and applications of sheet insertion in a hexahedral mesh. A hexahedral sheet is dual to a layer of hexahedra in a hexahedral mesh. Because of symmetries within a hexahedral element, every hexahedral mesh can be viewed as a collection of these sheets. It is possible to insert new sheets into an existing mesh, and these new sheets can be used to define new mesh boundar...
متن کاملHexahedral mesh generation via constrained quadrilateralization
Decomposing a volume into high-quality hexahedral cells is a challenging task in finite element simulations and computer graphics. Inspired by the use of a spatial twist continuum and frame field in previous hexahedral mesh generation methods, we present a method of hexahedral mesh generation via constrained quadrilateralization that combines a spatial twist continuum and frame fields. Given a ...
متن کاملSheet-Based Hexahedral Mesh Generation
Historically, hexahedral finite element mesh generation has required significant geometric decomposition with the resulting consequence that generating hexahedral meshes can be extremely difficult to perform and automate and the process often takes several orders of magnitude longer in time to complete than current methods for generating tetrahedral meshes. In this work, we present methods for ...
متن کاملAutomated Hexahedral Mesh Generation by Swept Volume Decomposition and Recomposition
In this paper a method is presented to generate uniform hexahedral meshes automatically. In this method, a solid model with complex geometry is decomposed into swept volumes with simpler geometry. A sweepable face on the solid model is selected as the generator face to generate a swept volume. Each generator face is specified with node density and a quadrilateral mesh is generated from it. Then...
متن کاملAlgorithms for Quadrilateral and Hexahedral Mesh Generation
This lecture reviews the state of the art in quadrilateral and hexahedral mesh generation. Three lines of development – block decomposition, superposition and the dual method – are described. The refinement problem is discussed, and methods for octree-based meshing are presented.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Graph Algorithms Appl.
دوره 5 شماره
صفحات -
تاریخ انتشار 2001